Interpolating Multilevel Green’s Function with Radial Basis Function and Phase Compensation
نویسندگان
چکیده
As a kernel independent algorithm, multilevel Green’s function interpolation method (MLGFIM) [1] [2] has been developed for electromagnetic problems from low frequency to fullwave simulation. This method inherits the multilevel tree structure of multilevel fast multipole algorithm (MLFMA) and adopts the interpolation technique of pre-corrected fast Fourier transform (PFFT). Compare with other fast algorithms based on the method of moment (MoM), MLGFIM has advantages in flexibility for both multilayered and sparsely distributed multibody problems. Interpolation method as the key technique in MLGFIM affects the accuracy of this algorithm. In full-wave simulation, because of the oscillatory nature of the phase term of the Green’s function, it is not easy to approximate the Green’s function between two interaction cubes when the cube size is much larger than a wavelength. There are two kinds of interpolation schemes to be implemented in full-wave problem: one is to apply orthonormal radial basis function (RBF), and the other is to combine Lagrange interpolation with phase compensation (PC). The RBF of inverse multiquadric (IMQ) type in conjunction with staggered Tartan grid is used in [2]. However, due to the increasing condition number which follows with the increasing number of interpolation points, the cube length is restricted below two wavelengths. The comparison of different types of infinitely smooth RBFs [3] shows that the Gaussian (GA) RBF can obtain the best interpolation accuracy under the same condition [4]. From [4], although the interpolation of field points in a cube larger than two wavelengths is implemented, the number of interpolation points increases drastically to guarantee the error under the interpolation threshold. This will generate low interpolation efficiency when MLGFIM is applied. To remedy this problem, Lagrange interpolation with PC is adopted to make the phase terms of Green’s functions vary slowly with the distance between the source and field points [5], [6]. In this paper, we propose a method applying augmented RBF to interpolate Green’s function with PC. The results show that at the same interpolation threshold, interpolating Green’s function with PC requires fewer interpolation points than interpolating the original one. We also find that GA RBF can get the best convergence rate. But if the number of interpolation points is large, it is more appropriate to adopt RBF of compact support due to the fact that it will generate a sparse interpolation matrix.
منابع مشابه
Fast Multilevel Evaluation of 1-D Piecewise Smooth Radial Basis Function Expansions
Radial basis functions (RBFs) are a powerful tool for interpolating/approximating multidimensional scattered data in R. However, a direct evaluation of an n-center RBF expansion at m points requires O(nm) operations, which is prohibitively expensive as n,m increase. We present a new multilevel method for uniformly dense centers and points and d = 1, whose cost is only O(C(n + m)), where C depen...
متن کاملMultilevel Sparse Kernel-Based Interpolation
A multilevel kernel-based interpolation method, suitable for moderately high-dimensional function interpolation problems, is proposed. The method, termed multilevel sparse kernelbased interpolation (MLSKI, for short), uses both level-wise and direction-wise multilevel decomposition of structured (or mildly unstructured) interpolation data sites in conjunction with the application of kernel-base...
متن کاملMultilevel sparse kernel-based interpolation using conditionally positive definite radial basis functions
A multilevel sparse kernel-based interpolation (MLSKI) method, suitable for moderately high-dimensional function interpolation problems has been recently proposed in [15]. The method uses both level-wise and direction-wise multilevel decomposition of structured or mildly unstructured interpolation data sites in conjunction with the application of kernel-based interpolants with different scaling...
متن کاملFast Multilevel Evaluation of Smooth Radial Basis Function Expansions
Abstract. Radial basis functions (RBFs) are a powerful tool for interpolating/approximating multidimensional scattered data. Notwithstanding, RBFs pose computational challenges, such as the efficient evaluation of an n-center RBF expansion at m points. A direct summation requires O(nm) operations. We present a new multilevel method whose cost is only O((n + m) ln(1/δ)), where δ is the desired a...
متن کاملEvaluation of New MOND Interpolating Function with Rotation Curves of Galaxies
The rotation curves of a sample of 46 low- and high-surface brightness galaxies are considered in the context of Milgrom's modi_ed dynamics (MOND) to test a new interpolating function proposed by Zhao et al. (2010) [1] and compare with the results of simple interpolating function. The predicted rotation curves are calculated from the total baryonic matter based on the B-band surface photometry,...
متن کامل